A method for calculating invariant subspaces of symmetric hyperbolic equations

An algorithm is constructed for calculating invariant subspaces of symmetric hyperbolic systems arising in electromagnetic, acoustic, and elasticity problems. Discrete approximations are calculated for subspaces that correspond to minimal eigenvalues and smooth eigenfunctions. Difficulties related to the presence of an infinite-dimensional kernel in the differential operator are successfully handled. The efficiency of the algorithm is demonstrated using acoustics equations.     

Commuting and stable feedback design for switched linear systems

In the paper, commuting and stable feedback design for switched linear systems is investigated. This problem is formulated as to build up suitable state feedback controller for each subsystem such that the closed-loop systems are not only asymptotically stable but also commuting each other. A new concept, common admissible eigenvector set (CAES), is introduced to establish necessary/sufficient conditions for commuting and stable feedback controllers. For second-order systems, a necessary and sufficient condition is established. Moreover, a parametrization of the CAES is also obtained. The motivation comes from stabilization of switched linear systems which consist of a family of LTI systems and a switching law specifying the switching between them, where if all the subsystems are stable and commuting each other, then the total system is stable under arbitrary switching.     

Generalized quasilinearization method for reaction-diffusion equations under nonlinear and nonlocal flux conditions

In this paper we consider an initial boundary value problem for a reaction-diffusion equation under nonlinear and nonlocal Robin type boundary condition. Assuming the existence of an ordered pair of upper and lower solutions we establish a generalized quasilinearization method for the problem under consideration whose characteristic feature consists in the construction of monotone sequences converging to the unique solution within the interval of upper and lower solutions, and whose convergence rate is quadratic. Thus this method provides an efficient iteration technique that produces not only improved approximations due to the monotonicity of its iterates, but yields also a measure of the convergence rate.     

Scale Invariance Properties in the Simulated Annealing Algorithm

The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed.     

Cosmic dust and our origins

The small solid particles in the space between the stars provide the surfaces for the production of many simple and complex molecules. Processes involving the effects of ultraviolet irradiation of the thin (hundredth micron) mantles are shown to produce a wide range of molecules and ions also seen in comets. Some of the more complex ones inferred from laboratory experiments are expected to play an important role in the origin of life. An outline of the chemical evolution of interstellar dust as observed and as studied in the laboratory is presented. Observations of comets are shown to provide substantial evidence for their being fluffy aggregates of interstellar dust as it was in the protosolar nebula, i.e. the interstellar cloud which collapsed to form the solar system. The theory that comets may have brought the progenitors of life to the earth is summarized.     

A MODEL OF TROPICAL MARINE RESERVE‐FISHERY LINKAGES

ABSTRACT. The excessive and unsustainable exploitation of our marine resources has led to the promotion of marine reserves as a fisheries management tool. Marine reserves, areas in which fishing is restricted or prohibited, can offer opportunities for the recovery of exploited stock and fishery enhancement. In this paper we examine the contribution of fully protected tropical marine reserves to fishery enhancement by modeling marine reserve‐fishery linkages. The consequences of reserve establishment on the long‐run equilibrium fish biomass and fishery catch levels are evaluated. In contrast to earlier models this study highlights the roles of both adult (and juvenile) fish migration and larval dispersal between the reserve and fishing grounds by employing a spawner‐recruit model. Uniform larval dispersal, uniform larval retention and complete larval retention combined with zero, moderate and high fish migration scenarios are analyzed in turn. The numerical simulations are based on Mombasa Marine National Park, Kenya, a fully protected coral reef marine reserve comprising approximately 30% of former fishing grounds. Simulation results suggest that the establishment of a fully protected marine reserve will always lead to an increase in total fish biomass. If the fishery is moderately to heavily exploited, total fishery catch will be greater with the reserve in all scenarios of fish and larval movement. If the fishery faces low levels of exploitation, catches can be optimized without a reserve but with controlled fishing effort. With high fish migration from the reserve, catches are optimized with the reserve. The optimal area of the marine reserve depends on the exploitation rate in the neighboring fishing grounds. For example, if exploitation is maintained at 40%, the ‘optimal’ reserve size would be 10%. If the rate increases to 50%, then the reserve needs to be 30% of the management area in order to maximize catches. However, even in lower exploitation fisheries (below 40%), a small reserve (up to 20%) provides significantly higher gains in fish biomass than losses in catch. Marine reserves are a valuable fisheries management tool. To achieve maximum fishery benefits they should be complemented by fishing effort controls.     

贝塞尔-高斯脉冲光束在色散介质中的时间和光谱特性

 对等衍射长度贝塞尔-高斯脉冲光束在色散介质中的时间和光谱特性作了研究，结果表明，通过选择适当的空间参数，贝塞尔-高斯脉冲光束沿轴上传输时，脉冲宽度不变。传输距离小于无衍射长度时，随衍射角增加，功率谱形状未变，脉冲波形保持不变；传输距离大于无衍射长度时，随衍射角增加，光谱由蓝移变为红移，脉冲展宽。     

ON HYPERBOLIC TIME DISCOUNTING IN EXHAUSTIBLE RESOURCE MODELS: AN APPLICATION TO WORLD OIL RESOURCES

ABSTRACT. Recent research on discounting in long term economic models involves hyperbolic discounting, in which the marginal discount rate shrinks as time passes. To investigate hyperbolic discounting and exhaustible resource allocation, this work develops a discrete‐time world oil model and model solution procedure, then uses the model to examine the consequences of adopting conventional (constant annual) discounting when hyperbolic discounting is appropriate, of adopting one hyperbolic discount rate path when a different hyperbolic path is appropriate, and of adopting hyperbolic discounting when conventional discounting is appropriate. Five conventional and two hyperbolic discount rate paths are considered. One hyperbolic path is that used by Nordhaus and Boyer [2000]; the other is that recommended by Weitzman [2001]. The generality of the findings is also assessed.     

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.     

颜色视觉匹配中明度阈值的评价

为了对颜色视觉匹配中的明度阈值特性进行评价,采用在阴极射线管显示器上获得的颜色刺激,在5个不同明度的中性色背景下,标准刺激的明度L*从5到95以5个CIELAB单位为变化步长,共对19个不同明度的中性标准颜色进行视觉匹配实验。通过对实验结果的处理和分析,验证了关于颜色刺激视觉辨别明度阈值与背景明度之间相关性的韦伯法则和crispening效应,同时利用颜色视觉匹配数据对基于CIELAB的相关色差公式进行了评价和比较,CIEDE2000具有最好的明度差预测性能,CMC次之,CIELAB和CIE94最差。